<html>
<head>
	<meta charset="UTF-8">
	<meta content="IE=edge" http-equiv="X-UA-Compatible">
	<meta content="initial-scale=1.0, maximum-scale=1.0, user-scalable=no, width=device-width" name="viewport">
	<title>3421：Poi2013 Walk</title>
	<!-- css -->
	<link href="../css/base.min.css" rel="stylesheet">
	<link href="../css/project.min.css" rel="stylesheet">
	
	<!-- favicon -->
	<!-- ... -->
</head>
<body class="page-brand">
	<header class="header header-transparent header-waterfall ui-header">
		<ul class="nav nav-list pull-left">
			<li>
				<a data-toggle="menu" href="#menu">
					<span class="icon icon-lg">menu</span>
				</a>
			</li>
		</ul>
		<a class="header-logo header-affix-hide margin-left-no margin-right-no" data-offset-top="213" data-spy="affix">Poi2013 Walk</a>
		<span class="header-logo header-affix margin-left-no margin-right-no" data-offset-top="213" data-spy="affix">Poi2013 Walk</span>
	</header>
	<nav aria-hidden="true" class="menu" id="menu" tabindex="-1">
		<div class="menu-scroll">
			<div class="menu-content">
				<a class="menu-logo" href="../index.html">BZOJ离线题库</a>
				<ul class="nav">
					<li>
						<a class="waves-attach" data-toggle="collapse" href="#problems">题目</a>
						<ul class="menu-collapse collapse in" id="problems">
							<li>
								<a class="waves-attach" href="../index.html">主页</a>
							</li>
							<li>
								<a class="waves-attach" href="../list.html">题目列表</a>
							</li>
						</ul>
					</li>
					<li>
						<a class="collapsed waves-attach" data-toggle="collapse" href="#about">关于</a>
						<ul class="menu-collapse collapse" id="about">
							<li>
								<a class="waves-attach" href="../about.html">关于此项目</a>
							</li>
						</ul>
					</li>
					
				</ul>
			</div>
		</div>
	</nav>
	<main class="content">
		<div class="content-header ui-content-header">
			<div class="container">
				<h1 class="content-heading">
                Poi2013 Walk                </h1>
                <p>时间限制：100s&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;  空间限制：256MB</p>			</div>
		</div>
		<div class="container">
			<section class="content-inner margin-top-no">
				<div class="row">
					<div class="col-lg-13 col-md-13">
						<div class="card margin-bottom-no">
							<div class="card-main">
								<div class="card-inner">
									
                                <h3>题目描述</h3><p><p><span style="font-size: medium">The names of towns in Byteotia are unique sequences of exactly N&nbsp; bits. There are 2^N &ndash; k towns in Byteotia, and thus, only K sequences of N&nbsp; bits do not correspond to any town.<br />
Some pairs of towns are connected with roads. Specifically, two towns are directly linked by a road if and only if their names differ in a single bit. The roads do not cross outside of towns.<br />
Byteasar intends to take a stroll - he intends to walk from the town x&nbsp; to the town y , taking the existing roads. Your task is to write a program that will determine if such a walk is possible.<br />
</span></p>
<p><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">有</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">2^N-k</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">个点，每个点有一个独一无二的、长度为</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">n</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">的</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">01</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">串，但是有</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">k</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">个</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">01</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">串没有出现过。每两个点之间有连边当且仅当两个</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">01</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">串之间有且仅有一个位置是不同的。现在询问</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">x</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">和</span><span lang="EN-US" style="font-family: Helvetica, 'Microsoft Yahei', verdana; font-size: 14px; line-height: 20.909090042114258px;">y</span><span style="font-size: 14px; line-height: 20.909090042114258px; font-family: 宋体;">两个字符串能不能互相到达</span></p></p><hr/><h3>输入格式</h3><p><p><font size="4">In the first line of the standard input, there are two integers, N&nbsp; and K (1&lt;=N&lt;=60,0&lt;=K&lt;=1000000,k&lt;=2^N-1, N*k&lt;=5000000)&nbsp; separated by a single space. These are the length of town names in bits and the the number of N -bit sequences that do not correspond to any town, respectively. In the second line, there are two strings, separated by a single space, each consisting of&nbsp;&nbsp; characters 0 and/or 1. These are the names of the towns x and y. In the K lines that follow, all the sequences of N bits that do not correspond to any town are given, one sequence per line. Each such sequence is a string of&nbsp;&nbsp; characters 0 and/or1. You may assume that x&nbsp; and&nbsp; y&nbsp; are not among those K sequences.<br />
</font></p></p><hr/><h3>输出格式</h3><p><p><font size="4">Your program should print to the standard output the word TAK (Polish for yes) if walking from the town x to the town y&nbsp; is possible, and the word NIE (Polish for no) otherwise.<br />
</font></p></p><hr/><h3>样例输入</h3><pre>4 6
0000 1011
0110
0111
0011
1101
1010
1001
</pre><hr/><h3>样例输出</h3><pre>TAK
</pre><hr/><h3>提示</h3><p>没有写明提示</p><hr/><h3>题目来源</h3><p>鸣谢HJWJBSR提供译文</p>
								</div>
							</div>
						</div>
					</div>
				</div>
				
				
			</section>
		</div>
	</main>

	<div class="fbtn-container">
		<div class="fbtn-inner">
			<a class="fbtn fbtn-lg fbtn-brand-accent waves-attach waves-circle waves-light waves-effect" data-toggle="dropdown" aria-expanded="true"><span class="fbtn-text fbtn-text-left">Menu</span><span class="fbtn-ori icon">apps</span><span class="fbtn-sub icon">close</span></a>
			<div class="fbtn-dropup">
				<a class="fbtn fbtn-brand waves-attach waves-circle waves-light waves-effect" href="../list.html" target="_self"><span class="fbtn-text fbtn-text-left">题目列表</span><span class="icon">menu</span></a>
				<a class="fbtn fbtn-green waves-attach waves-circle waves-effect" href="../index.html" target="_self"><span class="fbtn-text fbtn-text-left">返回主页</span><span class="icon">home</span></a>
				<a class="fbtn waves-attach waves-circle waves-effect" href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=3421" target="_blank"><span class="fbtn-text fbtn-text-left">提交代码</span><span class="icon">send</span></a>
				<a class="fbtn fbtn-orange waves-attach waves-circle waves-effect" href="http://www.lydsy.com/JudgeOnline/wttl/wttl.php?pid=3421" target="_blank"><span class="fbtn-text fbtn-text-left">试题讨论</span><span class="icon">chat</span></a>
				
			</div>
		</div>
	</div>

	<!-- js -->
	<script src="../js/jquery.min.js"></script>
	<script src="../js/base.min.js"></script>
	<script src="../js/project.min.js"></script>
</body>
</html>